Tableaux for Diagnosis Applications
نویسندگان
چکیده
In [NF96] a very efficient system for solving diagnosis tasks has been described, which is based on belief revision procedures and uses first order logic system descriptions. In this paper we demonstrate how such a system can be rigorously formalized from the viewpoint of deduction by using the calculus of hyper tableaux [BFN96]. The benefits of this approach are twofold: first, it gives us a clear logical description of the diagnosis task to be solved; second, as our experiments show, the approach is feasible in practice and thus serves as an example of a successful application of deduction techniques to real-world applications.
منابع مشابه
Semantically Guided Theorem Proving for Diagnosis Applications
In this paper we demonstrate how general purpose automated theorem proving techniques can be used to solve realistic model-based diagnosis problems. For this we modify a model generating tableau calculus such that a model of a correctly behaving device can be used to guide the search for minimal n-fault diagnoses. Our experiments show that our general approach is competitive with specialized di...
متن کاملSemantically Guided Theorem Proving for Diagnosis Applications
In this paper we demonstrate how general purpose automated theorem proving techniques can be used to solve realistic model-based diagnosis problems. For this we modify a model generating tableau calculus such that a model of a correctly behaving device can be used to guide the search for minimal diagnoses. Our experiments show that our general approach is competitive with specialized diagnosis ...
متن کاملStraightening Laws for Row-Convex Tableaux
We introduce the notion of a straight tableau and prove that the straight tableaux of xed row-convex shape form a basis for the GL n -representations and the general linear Lie superalgebra representations associated to the given shape. We provide a straightening algorithm for expressing arbitrary tableaux in terms of straight tableaux. These techniques can be modi ed to provide bases for repre...
متن کاملOrdered Tableaux: Extensions and Applications
In this paper several conceptual extensions to the theory of order-restricted free variable clausal tableaux which was initiated in 9, 8] are presented: atom orderings are replaced by the more general concept of a selection function, the substitutivity condition required for lifting is for certain variants of the calculus replaced by a much weaker assumption, and a rst version of order-restrict...
متن کاملPermutation tableaux and permutation patterns
Lauren Williams (joint work with Einar Steingrímsson) We introduce and study a class of tableaux which we call permutation tableaux; these tableaux are naturally in bijection with permutations, and they are a distinguished subset of the " Le-diagrams " of Alex Postnikov. The structure of these tableaux is in some ways more transparent than the structure of permutations; therefore we believe tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997